Connected majority domatic number of a graph
نویسندگان
چکیده
منابع مشابه
Domatic Number of Graph Products
A partition of V (G), all of whose classes are dominating sets in G, is called a domatic partition of G. The maximum number of classes of a domatic partition of G is called the domatic number of G. The concept of a domatic number was introduced in [1]. More interesting results on domatically full graphs, domatically critical, domatically cocritical graphs and other domatic numbers can be found ...
متن کاملconnected cototal domination number of a graph
a dominating set $d subseteq v$ of a graph $g = (v,e)$ is said to be a connected cototal dominating set if $langle d rangle$ is connected and $langle v-d rangle neq phi$, contains no isolated vertices. a connected cototal dominating set is said to be minimal if no proper subset of $d$ is connected cototal dominating set. the connected cototal domination number $gamma_{ccl}(g)$ of $g$ is the min...
متن کاملThe b-domatic number of a graph
Besides the classical chromatic and achromatic numbers of a graph related to minimum or minimal vertex partitions into independent sets, the b-chromatic number was introduced in 1998 thanks to an alternative definition of the minimality of such partitions. When independent sets are replaced by dominating sets, the parameters corresponding to the chromatic and achromatic numbers are the domatic ...
متن کاملSigned star k-domatic number of a graph
Let G be a simple graph without isolated vertices with vertex set V (G) and edge set E(G) and let k be a positive integer. A function f : E(G) → {−1, 1} is said to be a signed star k-dominating function on G if ∑ e∈E(v) f(e) ≥ k for every vertex v of G, where E(v) = {uv ∈ E(G) | u ∈ N(v)}. A set {f1, f2, . . . , fd} of signed star k-dominating functions on G with the property that ∑d i=1 fi(e) ...
متن کاملThe Signed Edge-Domatic Number of a Graph
For a nonempty graph G = (V, E), a signed edge-domination of G is a function f : E(G) → {1,−1} such that ∑e′∈NG [e] f (e′) ≥ 1 for each e ∈ E(G). The signed edge-domatic number of G is the largest integer d for which there is a set { f1, f2, . . . , fd} of signed edge-dominations of G such that ∑d i=1 fi (e) ≤ 1 for every e ∈ E(G). This paper gives an original study on this concept and determin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Malaya Journal of Matematik
سال: 2019
ISSN: 2319-3786,2321-5666
DOI: 10.26637/mjm0s01/0014